Parallel Preconditioners for Sparse Iterative Methods: A short tutorial
نویسنده
چکیده
A shorter version of this report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties).
منابع مشابه
Parallel Iterative Computational Methods for 3d Finite Element Flow Simulations
In this paper we discuss sparse matrix computational methods, and their parallel implementations, for evaluating matrix-vector products in iterative solution of coupled, nonlinear equations encountered in finite element flow simulations. Based on sparse computation schemes, we introduce globallydefined preconditioners by mixing clustered element-by-element preconditioning concept with incomplet...
متن کاملParallel Iterative Computational Methods for 3d Finite Elernent Flow Simulations
In this paper 1ve discuss sparse matrix computational methods, and their parallel implementations, for evaluating matrix-vector products in iterative solution of coupled, nonlinear equations encountered in finite element florv simulations. Based on sparse computation schemes, we introduce globallv-defined preconditioners by mixing clustered element-by-element preconditioning concept with incomp...
متن کاملPerformance evaluation of a new parallel preconditioner
Solution of partial differential equations by either the finite element or the finite difference methods often requires the solution of large, sparse linear systems. When the coefficient matrices associated with these linear systems are symmetric and positive definite, the systems are often solved iteratively using the preconditioned conjugate gradient method. We have developed a new class of p...
متن کاملBlock-ADI Preconditioners for Solving Sparse Nonsymmetric Linear Systems of Equations
There is currently a regain of interest in the Alternating Direction Implicit (ADI) algorithms as preconditioners for iterative methods for solving large sparse linear systems, because of their suitability for parallel computing. However, the classical ADI iteration is not directly applicable to Finite Element (FE) matrices, tends to converge too slowly for 3-D problems, and the selection of ad...
متن کاملCarnegie Mellon University Pittsburgh , PA 15213 Keith D . Gremban Marco ZaghaGary L .
Solution of partial differential equations by either the finite element or the finite difference methods often requires the solution of large, sparse linear systems. When the coefficient matrices associated with these linear systems are symmetric and positive definite, the systems are often solved iteratively using the preconditioned conjugate gradient method. We have developed a new class of p...
متن کامل